Plane and projective meanders

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumerations of plane meanders

A closed plane meander of order n is a closed self-avoiding loop intersecting an infinite line 2n times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on transfer matrix methods, for the enumeration of plane meanders. This allows us to calculate the number of closed meanders up to n = 24. The algorithm is eas...

متن کامل

Critical exponents of plane meanders

Meanders form a set of combinatorial problems concerned with the enumeration of self-avoiding loops crossing a line through a given number of points, n. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We use a recently developed algorithm, based on transfer matrix methods, to enumerate plane meanders. This allows us to calculate the number of closed meander...

متن کامل

Plane-based Projective Reconstruction

A linear method for computing a projective reconstruction from a large number of images is presented and then evaluated. The method uses planar homographies between views to linearize the resecting of the cameras. Constraints based on the fundamental matrix, trifocal tensor or quadrifocal tensor are used to derive relationships between the position vectors of all the cameras at once. The result...

متن کامل

Simpler Projective Plane Embedding

A projective plane is equivalent to a disk with antipodal points identiied. A graph is projective planar if it can be drawn on the projective plane with no crossing edges. A linear time algorithm for projective planar embedding has been described by Mohar 20]. We provide a new approach that takes O(n 2) time is but much easier to implement. 1 Description of the problem A graph G consists of a s...

متن کامل

A transfer matrix approach to the enumeration of plane meanders

A closed plane meander of order n is a closed self-avoiding curve intersecting an infinite line 2n times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on transfer matrix methods, for the enumeration of plane meanders. While the algorithm has exponential complexity, its rate of growth is much smaller than tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1993

ISSN: 0304-3975

DOI: 10.1016/0304-3975(93)90316-l